Nearest neighbor Markov dynamics on Macdonald processes
نویسندگان
چکیده
منابع مشابه
Unpredictable Nearest Neighbor Processes
Benjamini, Pemantle, and Peres constructed nearest neighbor processes which have predictability profiles that decay faster than that of the simple random walk. Häggström and Mossel found processes with even faster decaying predictability profiles. We prove that rate of decay achieved by Häggström and Mossel is optimal.
متن کاملOn Nearest-Neighbor Graphs
The “nearest neighbor” relation, or more generally the “k nearest neighbors” relation, defined for a set of points in a metric space, has found many uses in computational geometry and clustering analysis, yet surprisingly little is known about some of its basic properties. In this paper, we consider some natural questions that are motivated by geometric embedding problems. We derive bounds on t...
متن کاملNearest neighbor conditional estimation for Harris recurrent Markov chains
This paper is concerned with consistent nearest neighbor time series estimation for data generated by a Harris recurrent Markov chain. The goal is to validate nearest neighbor estimation in this general time series context, using simple and weak conditions. The framework considered covers, in a unified manner, a wide variety of statistical quantities, e.g. autoregression function, conditional q...
متن کاملDetection of Gauss-Markov Random Fields with Nearest-Neighbor Dependency
The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, a closed-form expression for the log-likelihood ratio is derived, in terms of the coefficients of its covariance matrix and the edges of the dependency graph. Assuming random placement of nodes over a large region according to the Poisson or uniform di...
متن کاملNearest Neighbor
Over the last decade, an immense amount of data has become available. From collections of photos, to genetic data, and to network traffic statistics, modern technologies and cheap storage have made it possible to accumulate huge datasets. But how can we effectively use all this data? The ever growing sizes of the datasets make it imperative to design new algorithms capable of sifting through th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Mathematics
سال: 2016
ISSN: 0001-8708
DOI: 10.1016/j.aim.2016.03.016